The stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs

نویسنده

  • Raffaele Mosca
چکیده

The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine different tools, in the context of a well known result of Chvátal [6] which allows to focus just on prime facet-inducing graphs, with particular reference to a structure result on prime (P6,triangle)-free graphs due to Brandstädt et al. [4]. Also we point out some peculiarities of new facet-inducing graphs detected along this study with the help of a software.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating facets for the cut polytope of a graph by triangular elimination

The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to ...

متن کامل

Coloring planar Toeplitz graphs and the stable set polytope

Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...

متن کامل

On facets of stable set polytopes of claw-free graphs with stability number three

Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a breakthrough for the subclass of quasi-line graphs. As a consequence, every non-trivial facet of their stable set polytope is of the form k ∑ v∈V1 xv+(k+1) ∑ v∈V2 xv ≤ b for some positive integers k and b, and non-empty...

متن کامل

Clique family inequalities for the stable set polytope of quasi-line graphs

In one of fundamental work in combinatorial optimization Edmonds gave a complete linear description of the matching polytope. Matchings in a graph are equivalent to stable sets its line graph. Also the neighborhood of any vertex in a line graph partitions into two cliques: graphs with this latter property are called quasi-line graphs. Quasi-line graphs are a subclass of claw-free graphs, and as...

متن کامل

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes

A graph is α-critical if its stability number increases whenever an edge is removed from its edge set. The class of α-critical graphs has several nice structural properties, most of them related to their defect which is the number of vertices minus two times the stability number. In particular, a remarkable result of Lovász (1978) is the finite basis theorem for α-critical graphs of a fixed def...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1404.7623  شماره 

صفحات  -

تاریخ انتشار 2014